منابع مشابه
Principled sure independence screening for Cox models with ultra-high-dimensional covariates
It is rather challenging for current variable selectors to handle situations where the number of covariates under consideration is ultra-high. Consider a motivating clinical trial of the drug bortezomib for the treatment of multiple myeloma, where overall survival and expression levels of 44760 probesets were measured for each of 80 patients with the goal of identifying genes that predict survi...
متن کاملSURE : Shizuoka University REpository
23 In the present study, two LCYb genes (CitLCYb1 and CitLCYb2) were 24 isolated from Satsuma mandarin (Citrus unshiu Marc.), Valencia orange (Citrus 25 sinensis Osbeck) and Lisbon lemon (Citrus limon Burm.f.) and their functions 26 were analyzed by the color complementation assay in lycopene-accumulating E. 27 coli cells. The results showed that CitLCYb1 and CitLCYb2 shared high identity 28 at...
متن کاملOn Time – For Sure
When a computer takes forever to load a website, it may be annoying, but it is nothing more serious than that. If, however, the electronics in a car or a plane don’t process commands exactly when they are supposed to, the consequences can be fatal. Björn Brandenburg and his team at the Max Planck Institute for Software Systems in Kaiserslautern and Saarbrücken study how to construct real-time s...
متن کاملAlmost Sure Productivity
We define Almost Sure Productivity (ASP), a probabilistic generalization of the productivity condition for coinductively defined structures. Intuitively, a probabilistic coinductive stream or tree is ASP if it produces infinitely many outputs with probability 1. Formally, we define almost sure productivity using a final coalgebra semantics of programs inspired from Kerstan and König. Then, we i...
متن کاملSure Success Partial Search
Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1981
ISSN: 0028-0836,1476-4687
DOI: 10.1038/292008c0